The excess of complex Hadamard matrices
نویسندگان
چکیده
A complex Hadamard matrix, C, of order n has elements 1, -1, i, i and satisfies CC* = nIn where C* denotes the conjugate transpose of C. Let C = [cij] be a complex Hadamard matrix of order n. S(C) = ∑ cij is called the sum of C. 0(C) = │S(C)│ is called the excess of C. We study the excess of complex Hadamard matrices. As an application many real Hadamard matrices of large and maximal excess are obtained. Disciplines Physical Sciences and Mathematics Publication Details H. Kharaghani and Jennifer Seberry, The excess of complex Hadamard matrices, Graphs and Combinatorics, 9, (1993), 47-56. This journal article is available at Research Online: http://ro.uow.edu.au/infopapers/1072 Graphs and Combinatorics (1993) 9: 47-56 Graphs and Combinatorics © Springer-Verlag 1993 The Excess of Complex Hadamard Matrices H. KharaghanP* and Jennifer Seberry2** 1 Department of Mathematical Sciences, The University of Lethbridge, Lethbridge, Alberta, TlK 3M4, Canada 2 Department of Computer Science, University ofWollongong, Wollongong, NSW 2500, Australia Abstract. A complex Hadamard matrix, C, of order n has elements 1, -1, i, i and satisfies CC* = nI. where C* denotes the conjugate transpose of C. Let C = [cijJ be a complex Hadamard matrix of order n. S(C) = I Cij is called the sum of C. u(C) = IS(c)1 is called the excess of C. We ij study the excess of complex Hadamard matrices. As an application many real Hadamard matrices of large and maximal excess are obtained. A complex Hadamard matrix, C, of order n has elements 1, -1, i, i and satisfies CC* = nI. where C* denotes the conjugate transpose of C. Let C = [cijJ be a complex Hadamard matrix of order n. S(C) = I Cij is called the sum of C. u(C) = IS(c)1 is called the excess of C. We ij study the excess of complex Hadamard matrices. As an application many real Hadamard matrices of large and maximal excess are obtained.
منابع مشابه
Hadamard matrices of order =8 (mod 16) with maximal excess
Kounias and Farmakis, in 'On the excess of Hadamard matrices', Discrete Math. 68 (1988) 59-69, showed that the maximal excess (or sum of the elements) of an Hadamard matrix of order h, o(h) for h = 4m(m -1) is given by o(4m(m 1))≤4(m 1)2(2m + 1). Kharaghani in 'An infinite class of Hadamard matrices of maximal excess' (to appear) showed this maximal excess can be attained if m is the order of a...
متن کاملExistence of SBIBD(4k2, 2k2±k, k2±k) and Hadamard matrices with maximal excess
It is shown that SBIED(4k 2 , 2Jc 2 ± k, P ± k) and Hadamard matrices with maximal excess exist for qs,q {q:q 1 (mod 4) is a prime power}, + 1, g the length of a Golay sequence}. There a proper n dimensional Hadamard matrix of order (4k2)n. Regular symmetric Hadamard matrices with constant diagonal are obtained for orders 4k2 whenever complete regular 4-sets of regular matrices of order k 2 exist.
متن کاملWeak log-majorization inequalities of singular values between normal matrices and their absolute values
This paper presents two main results that the singular values of the Hadamard product of normal matrices $A_i$ are weakly log-majorized by the singular values of the Hadamard product of $|A_{i}|$ and the singular values of the sum of normal matrices $A_i$ are weakly log-majorized by the singular values of the sum of $|A_{i}|$. Some applications to these inequalities are also given. In addi...
متن کاملThe excess of Hadamard matrices and optimal designs
Hadamard matrices of order n with maximum excess o(n) are constructed for n = 40, 44, 48, 52, 80, 84. The results are: o(40)= 244, o(44)= 280, o(48)= 324, o(52)= 364, o(80)= 704, 0(84) = 756. A table is presented listing the known values of o(n) 0< n ~< 100 and the corresponding Hadamard matrices are constructed. For the remaining values of n = 56, 60, 68, 72, 76, 88, 92, 96 the largest values ...
متن کاملComplex Hadamard Matrices from Sylvester Inverse Orthogonal Matrices
A novel method to obtain parameterizations of complex inverse orthogonal matrices is provided. These matrices are natural generalizations of complex Hadamard matrices which depend on non zero complex parameters. The method we use is via doubling the size of inverse complex conference matrices. When the free parameters take values on the unit circle the inverse orthogonal matrices transform into...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 9 شماره
صفحات -
تاریخ انتشار 1993